Computing total edge irregularity strength of some n-uniform cactus chain graphs and related chain graphs
نویسندگان
چکیده
منابع مشابه
On Total Edge Irregularity Strength of Staircase Graphs and Related Graphs
Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...
متن کاملTotal vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملtotal vertex irregularity strength of corona product of some graphs
a vertex irregular total k-labeling of a graph g with vertex set v and edge set e is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. the total vertex irregularity strength of g, denoted by tvs(g)is the minimum value of the largest label k over all such irregular assignment. in this paper, we study the to...
متن کاملOn the total edge irregularity strength of zigzag graphs
An edge irregular total k-labeling of a graph G is a labeling of the vertices and edges with labels 1, 2, . . . , k such that the weights of any two different edges are distinct, where the weight of an edge is the sum of the label of the edge itself and the labels of its two end vertices. The minimum k for which the graph G has an edge irregular total k-labeling is called the total edge irregul...
متن کاملOn the total edge irregularity strength of hexagonal grid graphs
An edge irregular total k-labeling of a graph G = (V,E) is a labeling φ : V ∪ E → {1, 2, . . . , k} such that the total edge-weights wt(xy) = φ(x) + φ(xy) + φ(y) are different for all pairs of distinct edges. The minimum k for which the graph G has an edge irregular total k-labeling is called the total edge irregularity strength of G. In this paper, we determined the exact values of the total e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian Journal of Combinatorics
سال: 2020
ISSN: 2541-2205
DOI: 10.19184/ijc.2020.4.1.6